Extremal problems on convex lattice polygons in sense of lp-metrics
نویسندگان
چکیده
منابع مشابه
Extremal problems for convex polygons
Consider a convex polygon Vn with n sides, perimeter Pn, diameter Dn, area An, sum of distances between vertices Sn and widthWn. Minimizing or maximizing any of these quantities while fixing another defines ten pairs of extremal polygon problems (one of which usually has a trivial solution or no solution at all). We survey research on these problems, which uses geometrical reasoning increasingl...
متن کاملLimit shape of optimal convex lattice polygons in the sense of different metrics
Classes of convex lattice polygons which have minimal lp–perimeter with respect to the number of their vertices are said to be optimal in the sense of lp metric. The purpose of this paper is to prove the existence and explicitly find the limit shape of the sequence of these optimal convex lattice polygons as the number of their vertices tends to infinity. It is proved that if p is arbitrary int...
متن کاملOn convex lattice polygons
Let II be a convex lattice polygon with b boundary points and c (5 1) interior points. We show that for any given a , the number b satisfies b 5 2e + 7 , and identify the polygons for which equality holds. A lattice polygon II is a simple polygon whose vertices are points of the integral lattice. We let A = 4(11) denote the area of II , b{U) the number of lattice points on the boundary of II , ...
متن کاملConvex Lattice Polygons
Let n ≥ 3 be an integer. A convex lattice n-gon is a polygon whose n vertices are points on the integer lattice Z 2 and whose interior angles are strictly less than π. Let a n denote the least possible area enclosed by a convex lattice n-gon, then [1, 2, 3] {a n } ∞ n=3 = n 1 2
متن کاملOn the Number of Convex Lattice Polygons
We prove that there are at most exp{cA 1 ^} different lattice polygons of area A. This improves a result of V. I. Arnol'd.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00384-9